- sorting memory
- 分类存储器
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
sorting memory
Look at other dictionaries:
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Memory — For other uses, see Memory (disambiguation). Neuropsychology Topics … Wikipedia
Memory development — The development of memory in children becomes evident within the first 2 to 3 years of a child s life as they show considerable advances in declarative memory. This enhancement continues into adolescence with major developments in short term… … Wikipedia
Memory virtualization — In computer science, memory virtualization decouples volatile random access memory (RAM) resources from individual systems in the data center, and then aggregates those resources into a virtualized memory pool available to any computer in the… … Wikipedia
External sorting — is a term for a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted does not fit into the main memory of a computing device (usually RAM) and a slower kind of memory… … Wikipedia
In-memory database — An in memory database (IMDB; also main memory database system or MMDB) is a database management system that primarily relies on main memory for computer data storage. It is contrasted with database management systems which employ a disk storage… … Wikipedia
Mood-dependent memory — Moods Mood dependence is the facilitation of memory when mood at retrieval is identical to the mood at encoding, or the process of memory. When a human encodes a memory, he or she not only records the visual and other sensory data, he also stores … Wikipedia
letter sorting machine — (LSM) A large mechanized machine that can sort letters into as many as 277 bins. Operators physically read the address and then manually enter an extraction code, via keyboard, based on their memory of the sort scheme loaded into the machine s… … Glossary of postal terms
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… … Wikipedia
